Exploiting Symmetries by Planning for a Descriptive Quotient
نویسندگان
چکیده
We eliminate symmetry from a problem before searching for a plan. The planning problem with symmetries is decomposed into a set of isomorphic subproblems. One plan is computed for a small planning problem posed by a descriptive quotient, a description of any such subproblem. A concrete plan is synthesized by concatenating instantiations of that one plan for each subproblem. Our approach is sound.
منابع مشابه
A ug 2 01 2 EXPLOITING SYMMETRIES IN SDP - RELAXATIONS FOR POLYNOMIAL OPTIMIZATION
In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimizati...
متن کاملStructural Symmetries of the Lifted Representation of Classical Planning Tasks
We transfer the notion of structural symmetries to lifted planning task representations, based on a generalizing concept of abstract structures we use to model planning tasks. We show that symmetries are preserved by common grounding methods and shed some light on the relation to previous symmetry concepts. An analysis of common planning benchmarks reveals that symmetries occur in the lifted re...
متن کاملExploiting Symmetries in SDP-Relaxations for Polynomial Optimization
In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semidefinite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimizati...
متن کاملExploiting Symmetry in Lifted CS
When search problems have large-scale symmetric structure, detecting and exploiting that structure can greatly reduce the size of the search space. Previous work has shown how to find and exploit symmetries in propositional encodings of constraint satisfaction problems (CSPs). Here we consider problems that have more compact “lifted” (quantified) descriptions from which propositional encodings ...
متن کاملExtending the Exploitation of Symmetries in Planning
Highly symmetric problems result in redundant search effort which can render apparently simple problems intractable. Whilst the potential benefits of symmetry-breaking have been explored in the broader search and constraint satisfaction community (see (Gent & Smith 2000; Ip & Dill 1996; Crawford et al. 1996) for examples) there has been relatively little interest in the exploitation of this pot...
متن کامل